Galton’s number

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge 2-rainbow domination number and annihilation number in trees

A edge 2-rainbow dominating function (E2RDF) of a graph G is a ‎function f from the edge set E(G) to the set of all subsets‎ ‎of the set {1,2} such that for any edge.......................

متن کامل

Uniform Number of a Graph

We introduce the notion of uniform number of a graph. The  uniform number of a connected graph $G$ is the least cardinality of a nonempty subset $M$ of the vertex set of $G$ for which the function $f_M: M^crightarrow mathcal{P}(X) - {emptyset}$ defined as $f_M(x) = {D(x, y): y in M}$ is a constant function, where $D(x, y)$ is the detour distance between $x$ and $y$ in $G$ and $mathcal{P}(X)$ ...

متن کامل

Fuzzy Number-Valued Fuzzy Graph

Graph theory has an important role in the area of applications of networks and clustering‎. ‎In the case of dealing with uncertain data‎, ‎we must utilize ambiguous data such as fuzzy value‎, ‎fuzzy interval value or values of fuzzy number‎. ‎In this study‎, ‎values of fuzzy number were used‎. ‎Initially‎, ‎we utilized the fuzzy number value fuzzy relation and then proposed fuzzy number-value f...

متن کامل

Tarski Number and Configuration Equations

The concept of configuration of groups which is defined in terms of finite partitions and finite strings of elements of the group is presented by Rosenblatt and Willis. To each set of configurations, a finite system of equations known as configuration equations, is associated. Rosenblatt and Willis proved that a discrete group G is amenable if and only if every possible instance of its configur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the Psychonomic Society

سال: 1991

ISSN: 0090-5054

DOI: 10.3758/bf03333935